computational scheme

computational scheme
skaičiavimo schema statusas T sritis automatika atitikmenys: angl. computational scheme vok. Rechenschema, n rus. схема вычислений, f pranc. circuit de calcul, m; circuit de comptage, m

Automatikos terminų žodynas. – Vilnius: Technika. . 2004.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Computational chemistry — is a branch of chemistry that uses principles of computer science to assist in solving chemical problems. It uses the results of theoretical chemistry, incorporated into efficient computer programs, to calculate the structures and properties of… …   Wikipedia

  • Computational electromagnetics — Computational electromagnetics, computational electrodynamics or electromagnetic modeling is the process of modeling the interaction of electromagnetic fields with physical objects and the environment. It typically involves using computationally… …   Wikipedia

  • Computational fluid dynamics — Computational physics Numerical analysis  …   Wikipedia

  • Computational humor — is a branch of computational linguistics and artificial intelligence which uses computers in humor research. It is not to be confused with computer humor (i.e., jokes about computers, programmers, users, and computing). It is a relatively new… …   Wikipedia

  • Computational Magnetohydrodynamics — (CMHD) is a rapidly developing branch of Magnetohydrodynamics that uses numerical methods and algorithms to solve and analyze problems that involve electrically conducting fluids. Most of the methods used in CMHD are borrowed from the well… …   Wikipedia

  • Computational magnetohydrodynamics — (CMHD) is a rapidly developing branch of magnetohydrodynamics that uses numerical methods and algorithms to solve and analyze problems that involve electrically conducting fluids. Most of the methods used in CMHD are borrowed from the well… …   Wikipedia

  • Computational Diffie–Hellman assumption — The computational Diffie–Hellman (CDH assumption) is the assumption that a certain computational problem within a cyclic group is hard. Consider a cyclic group G of order q. The CDH assumption states that, given for a randomly chosen… …   Wikipedia

  • Computational Diffie-Hellman assumption — The computational Diffie Hellman (CDH) assumption is the assumption that a certain computational problem within a cyclic group is hard.Consider a cyclic group {mathbb G} of order q. The CDH assumption states that, given :(g,g^a,g^b) for a… …   Wikipedia

  • Commitment scheme — In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to a value so that they cannot adapt to other messages in… …   Wikipedia

  • MUSCL scheme — MUSCL stands for Monotone Upstream centered Schemes for Conservation Laws , and the term was introduced in a seminal paper by Bram van Leer (van Leer, 1979). In this paper he constructed the first high order , total variation diminishing (TVD)… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”